|
Laplacian smoothing is an algorithm to smooth a polygonal mesh.〔.〕〔 〕 For each vertex in a mesh, a new position is chosen based on local information (such as the position of neighbors) and the vertex is moved there. In the case that a mesh is topologically a rectangular grid (that is, each internal vertex is connected to four neighbors) then this operation produces the Laplacian of the mesh. More formally, the smoothing operation may be described per-vertex as: : Where is the number of adjacent vertices to node , is the position of the -th adjacent vertex and is the new position for node . ==See also== *Tutte embedding, an embedding of a planar mesh in which each vertex is already at the average of its neighbors' positions 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Laplacian smoothing」の詳細全文を読む スポンサード リンク
|